Analysis of Bipartite Graph Codes on the Binary Erasure Channel
نویسنده
چکیده
We derive density evolution equations for codes on bipartite graphs (BG codes) for the binary erasure channel (BEC). We study the cases of local codes being introduced on only one side of the graph (Generalized LDPC codes) as well as on both sides. Each local code is assumed to correct up to a number of erasures one less than its distance. We define and enumerate stopping sets for BG codes, which serves an important tool for analysis of decoding thresholds on the BEC.
منابع مشابه
Construction and Performance Analysis of BIBD-QC-LDPC Codes for Correcting Erasure-Bursts
This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the c...
متن کاملEnsemble Analysis on Minimum Span of Stopping Sets
In this paper, the minimum span of stopping sets of regular LDPC codes are defined and analyzed. The minimum span of an LDPC code is closely related to immunity to burst erasures when an LDPC code is decoded with belief propagation (BP) for erasure channels. The minimum span of stopping sets is the smallest span of a non-empty stopping set. If a single erasure burst of length shorter than the m...
متن کاملDesign of Irregular Graphs for Erasure Decoding∗
Low-density parity check codes (LDPC codes) were introduced by Gallager [2] and have received intensive study in the last few years, as advances in technology have made their implementation far more practical than when they were originally proposed. Basically, an LDPC code is a binary linear block code defined by a sparse m × n parity-check matrix H . Equivalently such a code can be thought of ...
متن کاملGraph-based Codes
This is a mini-course on graph-based codes, given at the Center for Theoretical Sciences at Taipei, Taiwan, July 12-15, 2004. In practical coding theory, the main challenge has been to find codes with rates close to channel capacity and with efficient encoding and decoding algorithms. Only recently was this accomplished, theoretically for the binary erasure channel but only experimentally for t...
متن کاملPerformance Analysis and Improvement of LT Codes over AWGN Channels
LT codes, the first universal erasure-correcting codes, have near-optimal performance over binary erasure channels for any erasure probability, but exhibit high bit error rate and error floor over the noisy channels. This paper investigated the performance of LT codes over the additive white Gaussian noise channels. We designed the systematic LT codes through reconstructing the bipartite graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008